package algorithm.view.maze;

/**
 * @author bingo
 * @Description   非递归走迷宫问题
 * @Date 2018/5/26
 */
public class Position {

    private int x;

    private int y;

    private Position prev;

    public Position(int x, int y, Position prev) {
        this.x = x;
        this.y = y;
        this.prev = prev;
    }

    public Position(int x, int y) {
        this(x,y,null);
    }

    public int getX() {
        return x;
    }

    public int getY() {
        return y;
    }

    public Position getPrev() {
        return prev;
    }
}
